#include <cstdio>
#include <utility>
#include <cstring>
#include <cmath>
using namespace std;
typedef pair<int, int> pii;

#define MAXN 205
#define XYDIS(x1,y1,x2,y2) (sqrt((x1-x2)*(x1-x2) + (y1-y2)*(y1-y2)))
#define DINF 1e9
#define MIN(a,b) (a<b?a:b)
#define MAX(a,b) (a>b?a:b)

int N;
pii V[MAXN];
double G[MAXN][MAXN];

void input() {
	for (int i=1; i<=N; i++) {
		int x, y;
		scanf("%d%d", &x, &y);
		V[i] = make_pair(x, y);
	}
	for (int i=1; i<=N; i++) {
		for (int j=1; j<=N; j++) {
			if (i==j) {
				G[i][j] = DINF;
			}
			else {
				G[i][j] = XYDIS(V[i].first, V[i].second, V[j].first, V[j].second);
			}
		}
	}
}

void floyd() {
	for (int k=1; k<=N; k++) {
		for (int i=1; i<=N; i++) {
			for (int j=1; j<=N; j++) {
				G[i][j] = MIN(G[i][j], MAX(G[i][k], G[k][j]));
			}
		}
	}
}

int main() {
	int k = 1;
	while (true) {
		scanf("%d", &N);
		if (N==0) break;
		input();
		floyd();
		printf("Scenario #%d\nFrog Distance = %.3f\n\n", k, G[1][2]);
		k++;
	}
	return 0;
}
